Odlyzko-schönhage Algorithm in Conductor Aspect
نویسنده
چکیده
An algorithm is given to efficiently compute, for large discriminant, L-functions of characters on the class group of a complex quadratic field. This is an analog in conductor aspect of the Odlyzko-Schönhage algorithm to compute the Riemann zeta function. Examples are included for about 21000L-functions with conductor near 10. The data shows good agreement with a symplectic random matrix model.
منابع مشابه
Odlyzko-schönage Algorithm in Conductor Aspect
In [6], Odlyzko and Schönhage developed an algorithm to compute the Riemann zeta function ζ(s) efficiently for values of s very high up in the critical strip. Their method depends on precomputation of Taylor series expansions of ζ(s) at regularly spaced points, which in turn can be done efficiently by a clever application of the Fast Fourier Transform. Rumely later implemented a version of this...
متن کاملApplication of Intelligent Water Drops in Transient Analysis of Single Conductor Overhead Lines Terminated to Grid-Grounded Arrester under Direct Lightning Strikes
In this paper, Intelligent water drop algorithm (IWD) is used to analyze single overhead line connected to grid-grounded arrester. In this approach, at first Norton’s equivalent circuit of the overhead line over lossy soil is computed by method of moments (MoM) and then for the problem under consideration, a nonlinear equivalent circuit in the frequency domain is proposed. Finally applying inte...
متن کاملTransient Analysis of the Single-Conductor Overhead Lines Connected to Grid-Grounded Arrester under Direct Lightning by Means of GA
In this paper, genetic algorithm-based approach for transient analysis of single transmission line connected to arrester is proposed. In this approach, the lightning channel striking the overhead line is first represented by a current source and this source is truncated by a finite set of frequency harmonies in time domain. Norton equivalent circuit viewed across arrester is then computed by me...
متن کاملImproved Low - Density Subset
The general subset sum problem is NP-complete. However, there are two algorithms, one due to Brickell and the other to Lagarias and Odlyzko, which in polynomial time solve almost all subset sum problems of suuciently low density. Both methods rely on basis reduction algorithms to nd short non-zero vectors in special lattices. The Lagarias-Odlyzko algorithm would solve almost all subset sum prob...
متن کاملAn amortized-complexity method to compute the Riemann zeta function
A practical method to compute the Riemann zeta function is presented. The method can compute ζ(1/2 + it) at any T 1/4 points in [T, T + T 1/4] using an average time of T 1/4+o(1) per point. This is the same complexity as the Odlyzko-Schönhage algorithm over that interval. Although the method far from competes with the Odlyzko-Schönhage algorithm over intervals much longer than T 1/4, it still h...
متن کامل